Spanning Trees as Approximation of Data Structures

نویسندگان

چکیده

The connections in a graph generate structure that is independent of coordinate system. This visual metaphor allows creating more flexible representation data than two-dimensional scatterplot. In this article, we present STAD (Simplified Topological Abstraction Data), parameter-free dimensionality reduction method projects high-dimensional into graph. generates an abstract by giving each point location which preserves the approximate distances original space. built upon Minimum Spanning Tree (MST) to new edges are added until correlation between from and dataset maximized. Additionally, supports inclusion additional functions focus exploration allow analysis perspectives, emphasizing traits otherwise would remain hidden. We demonstrate effectiveness our applying it two real-world datasets: traffic density Barcelona temporal measurements air quality Castile León Spain.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Counting the number of spanning trees of graphs

A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.

متن کامل

NUMBER OF SPANNING TREES FOR DIFFERENT PRODUCT GRAPHS

In this paper simple formulae are derived for calculating the number of spanning trees of different product graphs. The products considered in here consists of Cartesian, strong Cartesian, direct, Lexicographic and double graph. For this purpose, the Laplacian matrices of these product graphs are used. Form some of these products simple formulae are derived and whenever direct formulation was n...

متن کامل

Parallelized approximation algorithms for minimum routing cost spanning trees

Let G = (V,E) be an undirected graph with a nonnegative edgeweight function w. The routing cost of a spanning tree T of G is ∑ u,v∈V dT (u, v), where dT (u, v) denotes the weight of the simple u-v path in T. The Minimum Routing Cost Spanning Tree (MRCT) problem [WLB+00] asks for a spanning tree of G with the minimum routing cost. In this paper, we parallelize several previously proposed approxi...

متن کامل

Frederickson, \data Structures for On-line Updating of Minimum Spanning Trees", Siam

We present algorithms for maintaining the biconnected components of a planar graph undergoing repeated dynamic modi cations, such as insertions and deletions of edges and vertices. We show how to test at any time whether two vertices belong to the same biconnected component, and how to insert and delete an edge in O(n 2=3 ) time in the worst case, where n is the number of vertices in the graph....

متن کامل

Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications

Data structures are presented for the problem of maintaining a. minimum spanning tree on-line under the operation of updating the cost of some edge in the graph. For the case of a general graph, maintaining the data structure and updating the tree are shown to take O(vm) time. where m is the number of edges in the graph. For the case of a planar graph, a data structure is presented which suppor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Visualization and Computer Graphics

سال: 2021

ISSN: ['1077-2626', '2160-9306', '1941-0506']

DOI: https://doi.org/10.1109/tvcg.2020.2995465